On hypercube labellings and antipodal monochromatic paths
نویسندگان
چکیده
منابع مشابه
On hypercube labellings and antipodal monochromatic paths
A labelling of the n-dimensional hypercube Hn is a mapping that assigns value 0 or 1 to each edge of Hn. A labelling is antipodal if antipodal edges of Hn get assigned different values. It has been conjectured that if Hn, n ≥ 2, is given a labelling that is antipodal, then there exists a pair of antipodal vertices joined by a monochromatic path. This conjecture has been verified by hand for n ≤...
متن کاملMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long (2013) conjectured that, in every antipodal 2-coloring of the edges of the hypercube, there exists a monochromatic geodesic between antipodal vertices. For this and an equivalent conjecture, we prove the cases n = 2, 3, 4, 5. We also examine the maximum number of monochromatic geodesics of length k i...
متن کاملMonochromatic Paths and Triangulated Graphs
This paper considers two properties of graphs, one geometrical and one topolog-ical, and shows that they are strongly related. Let G be a graph with four distinguished and distinct vertices, w 1 ; w 2 ; b 1 ; b 2. Consider the two properties, T RI + (G) and M ON O(G), deened as follows. T RI + (G): There is a planar drawing of G such that: all 3-cycles of G are faces; all faces of G are triangl...
متن کاملMonochromatic Vs multicolored paths
Let l and k be positive integers, and let X = {0, 1, . . . , l}. Is it true that for every coloring δ : X × X → {0, 1, . . .} there either exist elements x0 < x1 < . . . < xl of X with δ(x0, x1) = δ(x1, x2) = . . . = δ(xl−1, xl), or else there exist elements y0 < y1 < . . . < yk of X with δ(yi−1, yi) 6= δ(yj−1, yj) for all 1 ≤ i < j ≤ k? We prove here that this is the case if either l ≤ 2, or k...
متن کاملThe Radio Antipodal and Radio Numbers of the Hypercube
A radio k-labeling of a connected graph G is an assignment f of non negative integers to the vertices of G such that |f(x)− f(y)| ≥ k + 1− d(x, y), for any two vertices x and y, where d(x, y) is the distance between x and y in G. The radio antipodal number is the minimum span of a radio (diam(G) − 1)-labeling of G and the radio number is the minimum span of a radio (diam(G))-labeling of G. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2012.12.025